On generalized Vietoris’ number sequences

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Generalized Mayer-vietoris Principle and Spectral Sequences

This is my spin of the some stuff from from [1]. CONTENTS 1. Double complexes 1 2. The generalized Mayer-Vietoris principle 6 3. Presheaves and sheaves 17 4. The Čech cohomology of presheaves 22 5. Spectral sequences 25 6. The Leray-Serre spectral sequence 32 References 34 1. DOUBLE COMPLEXES Suppose that R is a commutative ring with 1. A double complex of R-modules is a bigraded R-module E•,• ...

متن کامل

Generalized Vietoris Bisimulations

We introduce and study bisimulations for coalgebras on Stone spaces [14]. Our notion of bisimulation is sound and complete for behavioural equivalence, and generalizes Vietoris bisimulations [3]. The main result of our paper is that bisimulation for a Stone coalgebra is the topological closure of bisimulation for the underlying Set coalgebra.

متن کامل

Mayer-vietoris Sequences in Stable Derivators

We show that stable derivators, like stable model categories, admit Mayer-Vietoris sequences arising from cocartesian squares. Along the way we characterize homotopy exact squares, and give a detection result for colimiting diagrams in derivators. As an application, we show that a derivator is stable if and only if its suspension functor is an equivalence.

متن کامل

On generalized Lucas sequences

We introduce the notions of unsigned and signed generalized Lucas sequences and prove certain polynomial recurrence relations on their characteristic polynomials. We also characterize when these characteristic polynomials are irreducible polynomials over a finite field. Moreover, we obtain the explicit expressions of the remainders of Dickson polynomials of the first kind divided by the charact...

متن کامل

On generalized Stanley sequences

Let N denote the set of all nonnegative integers. Let k ≥ 3 be an integer and A0 = {a1, . . . , at} (a1 < . . . < at) be a nonnegative set which does not contain an arithmetic progression of length k. We denote A = {a1, a2, . . . } defined by the following greedy algorithm: if l ≥ t and a1, . . . , al have already been defined, then al+1 is the smallest integer a > al such that {a1, . . . , al}...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2019

ISSN: 0166-218X

DOI: 10.1016/j.dam.2018.10.017